Dissemination of Information in Vertex-Disjoint Paths Mode
نویسندگان
چکیده
The communication modes (one-way and two-way mode) used for disseminating information among processors of interconnection networks via vertex-disjoint paths in one communication step are investigated. The complexity of communication algorithms is measured by the number of communication steps (rounds). Since optimal broadcast and accumulation algorithms for these modes can be achieved in a straightforward way for almost all interconnection networks used, the paper concentrates on the gossip problem. The main results are listed below: 1. Optimal gossip algorithms for paths, complete graphs and akes in both modes. which are only about O(log 2 log 2 n) rounds slower than the optimal gossip algorithms on complete graphs are designed. Furthermore, it is shown that at least (log 2 log 2 log 2 n) rounds more than needed by the optimal gossip algorithm on the complete graph are necessary for every \well-structured" gossip algorithm on networks with \small" degree. Note that the results achieved have also practical application, because the vertex-disjoint paths mode can be implemented in several hardware realisations of computing networks.
منابع مشابه
Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol
In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active ro...
متن کاملFinding Disjoint Paths on Edge-Colored Graphs: More Tractability Results
The problem of finding the maximum number of vertex-disjoint uni-color paths in an edge-colored graph (MaxCDP) has been recently introduced in literature, motivated by applications in social network analysis. In this paper we investigate how the complexity of the problem depends on graph parameters (distance from disjoint paths and size of vertex cover), and that is not FPT-approximable. Moreov...
متن کاملEfficient algorithms for minimal disjoint path problems on chordal graphs
Disjoint paths have applications in establishing bottleneck-free communication between processors in a network. The problem of finding minimum delay disjoint paths in a network directly reduces to the problem of finding the minimal disjoint paths in the graph which models the network. Previous results for this problem on chordal graphs were an O(| V | | E |) algorithm for 2 edge disjoint paths ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers and Artificial Intelligence
دوره 15 شماره
صفحات -
تاریخ انتشار 1996